Deadlock Avoidance in Batch Processes
نویسندگان
چکیده
A Petri net based approach for the modeling of batch plants as well as products is presented. Allocating non-sharable resources for product recipes can lead to deadlocks. In this paper we focus on the detection of potential deadlock situations using a graph structure derived from synchronization issues that arise when moving a batch between resources. It is shown that different graph patterns define potential deadlocks. These patterns even suggest how to implement a Petri net supervisor to avoid these deadlocks.
منابع مشابه
A Scalable Deadlock Avoidance Policy for Batch Processes
Allocating non-sharable resources for jobs in batch processes can lead to deadlocks. Using colored di-graphs to model the wait-relationship between resources in a job-path, a graph-theoretic approach is proposed to give necessary conditions for the existence of unsafe system states, i.e., allocations that will prevent some jobs from successful execution. Based on these necessary conditions a co...
متن کاملRobustness of deadlock avoidance algorithms for sequential processes
Although deadlock avoidance issue has attracted much attention and has been extensively studied, most of the existing results assume reliable machines. This assumption makes it di1cult to apply existing deadlock avoidance algorithms to real manufacturing systems with unreliable machines. This paper presents the results to apply an existing deadlock avoidance algorithm to systems with unreliable...
متن کاملModular Supervisors for Deadlock Avoidance in Batch Processes
Petri net based models for plants and recipes are presented. The plant consists of processors and a transporting system connecting the processors. Processors are typically resources like reactors and tanks, while the transporting system consists of, for example, pipes, valves and pumps. Starting with these models we synthesize a discrete, modular supervisor which coordinates the concurrent exec...
متن کاملRobustness of Dealock Avoidance Algorithms for Sequential Processes
Although deadlock avoidance issue has attracted much attention and has been extensively studied, most of the existing results assume reliable machines, which makes it difficult to apply existing deadlock avoidance algorithms to a real manufacturing system with unreliable machines. This paper presents the results to apply existing deadlock avoidance algorithms to systems with unreliable machines...
متن کاملTime Efficient Deadlock Resolution Algorithms
Deadlock is a major concern in a distributed system, since resources are shared among processes at sites distributed across a network. One of the most accepted methods of deadlock handling is detection and resolution. Both deadlock prevention and avoidance strategies are conservative solutions, whereas deadlock detection is optimistic. Furthermore, by the nature of database access, deadlock pre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999